GPU-based tuning of quantum-inspired genetic algorithm for a combinatorial optimization problem
نویسندگان
چکیده
This paper concerns efficient parameters tuning (meta-optimization) of a state-of-the-art metaheuristic, Quantum-Inspired Genetic Algorithm (QIGA), in a GPU-based massively parallel computing environment (NVidia CUDAtechnology). A novel approach to parallel implementation of the algorithm has been presented. In a block of threads, each thread transforms a separate quantum individual or different quantum gene; In each block, a separate experiment with different population is conducted. The computations have been distributed to eight GPU devices, and over 400× speedup has been gained in comparison to Intel Core i7 2.93GHz CPU. This approach allows efficient meta-optimization of the algorithm parameters. Two criteria for the meta-optimization of the rotation angles in quantum genes state space have been considered. Performance comparison has been performed on combinatorial optimization (knapsack problem), and it has been presented that the tuned algorithm is superior to Simple Genetic Algorithm and to original QIGA algorithm.
منابع مشابه
BQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملA new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کاملDevelopment of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملAn optimization technique for vendor selection with quantity discounts using Genetic Algorithm
Vendor selection decisions are complicated by the fact that various conflicting multi-objective factors must be considered in the decision making process. The problem of vendor selection becomes still more compli-cated with the inclusion of incremental discount pricing schedule. Such hard combinatorial problems when solved using meta heuristics produce near optimal solutions. This paper propose...
متن کامل